On the fastest finite Markov processes
نویسندگان
چکیده
منابع مشابه
ON THE INFINITE ORDER MARKOV PROCESSES
The notion of infinite order Markov process is introduced and the Markov property of the flow of information is established.
متن کاملFastest Mixing Markov Chain on a Path
Simulation using Markov chain Monte Carlo is a mainstay of scientific computing; see, e.g., [4, 5] for pointers to the literature. Thus the analysis and design of fast mixing Markov chains, with given stationary distribution, has become a research area. In [2], we show how to numerically find the fastest mixing Markov chain (i.e., the one with smallest secondlargest eigenvalue modulus) on a giv...
متن کاملFastest Mixing Markov Chain on a Graph
We consider a symmetric random walk on a connected graph, where each edge is labeled with the probability of transition between the two adjacent vertices. The associated Markov chain has a uniform equilibrium distribution; the rate of convergence to this distribution, i.e., the mixing rate of the Markov chain, is determined by the second largest (in magnitude) eigenvalue of the transition matri...
متن کاملON THE GENERALIZATION OF N-PLE MARKOV PROCESSES
The notion of N-ple Markov process is defined in a quite general framework and it is shown that N-ple Markov processes-arel inear combinationso f some martingales
متن کاملOn the Complexity of Finite Markov Decision Processes
Introduction Main notions Optimal strategies under Total Observability Complexity of Markov strategies. Finite Memory Strategies. Randomized strategies. Total Unobservability. Bounded Unobservability. Address: Université Paris-12, Equipe d’Informatique Fondamentale, 61, Ave. du Général de Gaulle, 94010 Créteil, France. E-mail: [email protected] Address: Dept. of Mathematics, Pennsylvani...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 2020
ISSN: 0022-247X
DOI: 10.1016/j.jmaa.2019.123488